Abstract We study the binary q -voter model with generalized anticonformity on random Erd?s–Rényi graphs. In such a model, two types of social responses, conformity and anticonformity, occur complementary probabilities size source influence $$q_c$$ q c in case is indepe...

Assuming a vacancy-mediated diffusion, continuum model for electromigration-driven transport of an embedded atom cluster across surface terrace phase-separating A$_x$B$_{1-x}$ alloy, such as fcc AgPt(111), is presented. Computations show that the electron wind carries over hundreds lattice spacings and in set direction, while grows its purity improves during drift. Impacts current density, diff...

To investigate the static and dynamic magnetic properties on uranium-based superconductor UTe$_{2}$, we measured NMR Knight shift $K$ nuclear spin-lattice relaxation rate $1/T_{1}$ in $H \parallel a$ by $^{125}$Te-NMR a $^{125}$Te-enriched single-crystal sample. $1/T_1T$ is much smaller than b$ $c$, fluctuations along each axis are derived from $H$ parallel to all three crystalline axes. The al...

The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the graph. Finding an optimal path cover for an arbitrary graph is known to be NP-complete [3]. However, polynornial-time algorithms exist for trees [4], cacti [4] and for interval graphs [9]. The solution presented in [2] For circular-arc graphs is known to be wrong. In ...

Geopersia is published biannually by the College of Science, University of Tehran, Iran. The College of Science published Journal of Science, which covered all fields of basic science, from 1968 to 2010. It was then decided that the College’s journals should be more specialized, and hence publication of Geopersia was launched. Articles printed in Geopersia will be available online too. Aims an...

cover

0

In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...

Motivated by the need for succinct representations of all “small” transversals (or hitting sets) of a hypergraph of fixed rank, we study the complexity of computing such a representation. Next, the existence of a minimal hitting set of at least a given size arises as a subproblem. We give one algorithm for hypergraphs of any fixed rank, and we largely improve an earlier algorithm (by H. Fernau,...